منابع مشابه
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.
متن کاملWreath Product Symmetric Functions
We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the Littlewood-Richardson rule are studied. We also discuss the connection with representations of generalized symmetric groups.
متن کاملFinite Generation and Presentability of Wreath Products of Monoids
This paper gives necessary and sufficient conditions for the restricted wreath product of two monoids to be finitely generated or finitely presented.
متن کاملWreath Product Action on Generalized Boolean Algebras
Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G ∼ Sn on the generalized Boolean algebra BX(n). We explicitly block diagonalize the commutant of this action.
متن کاملSemidirect Products and Wreath Products of Strongly Π-inverse Monoids
In this paper we determine the necessary and sufficient conditions for the semidirect products and the wreath products of two monoids to be strongly π-inverse. Furthermore, we determine the least group congruence on a strongly π-inverse monoid, and we give some important isomorphism theorems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1982
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-9-1-181-185